Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
61	Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:04 Analysis of algorithms Online algorithms Finite fields Computer science Computational complexity theory XTR List update problem Competitive analysis Applied mathematics
62	VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms Add to Reading List Source URL: www.vsgc.odu.edu Language: English - Date: 2013-05-02 13:43:42 Computational complexity theory Operations research Mathematics Theory of computation Mathematical optimization Optimization problem Algorithm Time complexity Evolutionary multimodal optimization Global optimization
63	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-07-07 05:51:55 Cryptography Zero-knowledge proof IP Distribution Computational complexity theory Interactive proof system Proof of knowledge
64	A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri Add to Reading List Source URL: spcl.inf.ethz.ch Language: English - Date: 2014-09-17 16:23:24 Sorting algorithms Computing Data processing Mathematics Algorithm Mathematical logic Theoretical computer science Sorting Sort Computational complexity theory Program optimization Selection algorithm
65	Computing Fundamentals Computational Complexity Salvatore Filippone–2015 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2015-06-11 10:49:26 Computational complexity theory Analysis of algorithms Theory of computation Computer science Mathematics Time complexity Best worst and average case Algorithm Average-case complexity Fast Fourier transform Generic-case complexity
66	A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:52:53 Cryptography Public-key cryptography Computational complexity theory Paillier cryptosystem Proof of knowledge Commitment scheme RSA Zero-knowledge proof Permutation ElGamal encryption IP
67	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
68	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:02 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Combinatorial optimization Maximal independent set Matching Connectivity Vertex cover Minimum spanning tree Leader election
69	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used Add to Reading List Source URL: www.amsterdamoptimization.com Language: English - Date: 2011-03-16 12:56:11 Operations research Mathematics Mathematical analysis Computational complexity theory Knapsack problem Cutting stock problem Dynamic programming Pi Linear programming Mathematical optimization Column generation
70	Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Packing problems Theory of computation Bin packing problem Bin

UPDATE